pi, szeged and revised szeged indices of ipr fullerenes
Authors
abstract
in this paper pi, szeged and revised szeged indices of an infinite family of ipr fullereneswith exactly 60+12n carbon atoms are computed. a gap program is also presented that isuseful for our calculations.
similar resources
PI, Szeged and Revised Szeged Indices of IPR Fullerenes
In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.
full textPI, Szeged and Edge Szeged Polynomials of a Dendrimer Nanostar
Let G be a graph with vertex and edge sets V(G) and E(G), respectively. As usual, the distance between the vertices u and v of a connected graph G is denoted by d(u,v) and it is defined as the number of edges in a minimal path connecting the vertices u and v. Throughout the paper, a graph means undirected connected graph without loops and multiple edges. In chemical graph theory, a molecular gr...
full textThe Wiener, Szeged, and PI Indices of a Dendrimer Nanosta
Let G= V E be a simple connected graph. The distance between two vertices of G is defined to be the length of the shortest path between the two vertices. There are topological indices assigned to G and based on the distance function which are invariant under the action of the automorphism group of G. Some important indices assigned to G are the Wiener, Szeged, and PI index which we will find th...
full textThe Vertex PI and Szeged Indices of Chain Graphs
The vertex Padmakar-Ivan (PIv) index of a graph G was introduced as the sum over all edges e = uv of G of the number of vertices which are not equidistant to the vertices u and v. In this paper we provide an analogue to the results of T. Mansour and M. Schork [The PI index of bridge and chain graphs, MATCH Commun. Math. Comput. Chem. 61 (2009) 723-734]. Two efficient formulas for calculating th...
full textWiener, Szeged and vertex PI indices of regular tessellations
A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of the same kind of regular polygons namely triangular, square, and hexagonal. Using edge congestion-sum problem, we devise a method to compute the Wiener index and demonstrate th...
full textThe Wiener, Szeged and Pi-indices of a Phenylazomethine Dendrimer
Let G be a simple graph with vertex set and edge set . The function which assigns to each pair of vertices in , the length of minimal path from to , is called the distance function between two vertices. The distance function between and edge and a vertex is where for and. , . The Wiener index of a graph is denoted by and is defined by .In general this kind of index is called a topological index...
full textMy Resources
Save resource for easier access later
Journal title:
iranian journal of mathematical chemistryPublisher: university of kashan
ISSN 2228-6489
volume 2
issue 2 2011
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023